InforLorV4, Main, Exploration, bibRecord, 00E357

Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time

Identifieur interne : 00E357 ( Main/Exploration ); précédent : 00E356; suivant : 00E358

Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time

Auteurs : Jean Gallier ; Paliath Narendran [États-Unis] ; David Plaisted ; Stan Raatz [États-Unis] ; Wayne Snyder

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:3F088B607782E59E482D2D9943842E2E3544883A

Abstract

Abstract: In this paper, it is shown that there is an algorithm which, given any finite set E of ground equations, produces a reduced canonical rewriting system R equivalent to E in polynomial time. This algorithm based on congruence closure performs simplification steps guided by a total simplification ordering on ground terms, and it runs in time O(n 3).

Url:

https://api.istex.fr/ark:/67375/HCB-0RTLPZNP-T/fulltext.pdf

DOI: 10.1007/BFb0012832

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 000E87
to stream Istex, to step Curation: 000E75
to stream Istex, to step Checkpoint: 003443
to stream Main, to step Merge: 00EC42
to stream Main, to step Curation: 00E357

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time</title>
<author><name sortKey="Gallier, Jean" sort="Gallier, Jean" uniqKey="Gallier J" first="Jean" last="Gallier">Jean Gallier</name>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
</author>
<author><name sortKey="Plaisted, David" sort="Plaisted, David" uniqKey="Plaisted D" first="David" last="Plaisted">David Plaisted</name>
</author>
<author><name sortKey="Raatz, Stan" sort="Raatz, Stan" uniqKey="Raatz S" first="Stan" last="Raatz">Stan Raatz</name>
</author>
<author><name sortKey="Snyder, Wayne" sort="Snyder, Wayne" uniqKey="Snyder W" first="Wayne" last="Snyder">Wayne Snyder</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:3F088B607782E59E482D2D9943842E2E3544883A</idno>
<date when="1988" year="1988">1988</date>
<idno type="doi">10.1007/BFb0012832</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-0RTLPZNP-T/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000E87</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000E87</idno>
<idno type="wicri:Area/Istex/Curation">000E75</idno>
<idno type="wicri:Area/Istex/Checkpoint">003443</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003443</idno>
<idno type="wicri:doubleKey">0302-9743:1988:Gallier J:finding:canonical:rewriting</idno>
<idno type="wicri:Area/Main/Merge">00EC42</idno>
<idno type="wicri:Area/Main/Curation">00E357</idno>
<idno type="wicri:Area/Main/Exploration">00E357</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time</title>
<author><name sortKey="Gallier, Jean" sort="Gallier, Jean" uniqKey="Gallier J" first="Jean" last="Gallier">Jean Gallier</name>
<affiliation><wicri:noCountry code="subField">Pa</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<affiliation wicri:level="2"><country>États-Unis</country>
<placeName><region type="state">État de New York</region>
</placeName>
<wicri:cityArea>General Electric Company Corporate Research and Development, 12345, Schenectady</wicri:cityArea>
</affiliation>
</author>
<author><name sortKey="Plaisted, David" sort="Plaisted, David" uniqKey="Plaisted D" first="David" last="Plaisted">David Plaisted</name>
<affiliation><wicri:noCountry code="subField">N.C.</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Raatz, Stan" sort="Raatz, Stan" uniqKey="Raatz S" first="Stan" last="Raatz">Stan Raatz</name>
<affiliation wicri:level="4"><orgName type="university">Université Rutgers</orgName>
<country>États-Unis</country>
<placeName><settlement type="city">New Brunswick (New Jersey)</settlement>
<region type="state">New Jersey</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Snyder, Wayne" sort="Snyder, Wayne" uniqKey="Snyder W" first="Wayne" last="Snyder">Wayne Snyder</name>
<affiliation><wicri:noCountry code="subField">Pa</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this paper, it is shown that there is an algorithm which, given any finite set E of ground equations, produces a reduced canonical rewriting system R equivalent to E in polynomial time. This algorithm based on congruence closure performs simplification steps guided by a total simplification ordering on ground terms, and it runs in time O(n 3).</div>
</front>
</TEI>
<affiliations><list><country><li>États-Unis</li>
</country>
<region><li>New Jersey</li>
<li>État de New York</li>
</region>
<settlement><li>New Brunswick (New Jersey)</li>
</settlement>
<orgName><li>Université Rutgers</li>
</orgName>
</list>
<tree><noCountry><name sortKey="Gallier, Jean" sort="Gallier, Jean" uniqKey="Gallier J" first="Jean" last="Gallier">Jean Gallier</name>
<name sortKey="Plaisted, David" sort="Plaisted, David" uniqKey="Plaisted D" first="David" last="Plaisted">David Plaisted</name>
<name sortKey="Snyder, Wayne" sort="Snyder, Wayne" uniqKey="Snyder W" first="Wayne" last="Snyder">Wayne Snyder</name>
</noCountry>
<country name="États-Unis"><region name="État de New York"><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
</region>
<name sortKey="Raatz, Stan" sort="Raatz, Stan" uniqKey="Raatz S" first="Stan" last="Raatz">Stan Raatz</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E357 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00E357 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:3F088B607782E59E482D2D9943842E2E3544883A
   |texte=   Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time

Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time

Source :

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri